Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listFeb 3, 2025 12:23Vladimir EvmenovVladimir EvmenovScore: 390,507Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2025 12:23389,0583,255,179,9133,152,228,00076,956,0002,281,472
2Feb 3, 2025 12:23389,1503,254,514,5683,154,997,00074,952,0002,281,472
3Feb 3, 2025 12:23389,1753,257,524,5543,169,189,00060,965,0002,506,752
4Feb 3, 2025 12:23389,5853,259,799,8213,168,585,00064,971,0002,281,472
5Feb 3, 2025 12:23390,5073,266,296,8903,171,248,00069,961,0002,293,760
6Feb 3, 2025 12:23391,1103,273,007,2753,178,252,00067,962,0002,281,472
7Feb 3, 2025 12:23391,2223,281,481,3253,170,184,00076,955,0002,281,472
8Feb 3, 2025 12:23394,1643,300,258,7333,209,586,00061,972,0002,510,848
9Feb 3, 2025 12:23397,6683,333,181,9673,244,683,00055,960,0002,293,760