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 13, 2026 20:20Daniel MastalerzDaniel MastalerzScore: 7,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 20:207,96591,180,55663,106,0003,005,0002,265,088
2Feb 13, 2026 20:207,96592,688,65563,105,0003,005,0002,277,376
3Feb 13, 2026 20:207,96695,832,05863,111,0003,005,0002,310,144
4Feb 13, 2026 20:207,97390,493,10662,169,0004,010,0002,330,624
5Feb 13, 2026 20:207,97593,355,61062,178,0004,011,0002,330,624
6Feb 13, 2026 20:207,97693,097,37163,191,0003,009,0002,314,240
7Feb 13, 2026 20:207,98188,056,26563,230,0003,010,0002,330,624
8Feb 13, 2026 20:208,00793,108,63663,440,0003,020,0002,330,624
9Feb 13, 2026 20:208,00988,834,12763,453,0003,021,0002,301,952