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 listMay 3, 2026 05:25limanjun99limanjun99Score: 5,345Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 05:265,31258,532,16841,017,0003,076,0002,416,640
2May 3, 2026 05:265,32559,209,39141,189,0003,013,0002,424,832
3May 3, 2026 05:265,33364,224,50841,251,0003,018,0002,428,928
4May 3, 2026 05:265,34260,609,14840,311,0004,031,0002,424,832
5May 3, 2026 05:265,34560,724,12340,333,0004,033,0002,433,024
6May 3, 2026 05:265,39066,835,60640,768,0003,977,0002,424,832
7May 3, 2026 05:265,40263,882,29539,859,0004,982,0002,428,928
8May 3, 2026 05:265,40763,569,84839,898,0004,987,0002,428,928
9May 3, 2026 05:265,43663,767,54241,114,0004,011,0002,416,640