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 listSep 24, 2026 07:46wnwnScore: 3,411Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 07:523,39436,971,55327,166,0001,007,0002,113,536
2Sep 24, 2026 07:523,39841,682,78427,123,0001,082,0002,113,536
3Sep 24, 2026 07:523,40037,051,26827,207,0001,013,0002,113,536
4Sep 24, 2026 07:523,41037,084,26327,222,0001,081,0002,113,536
5Sep 24, 2026 07:523,41137,099,95227,239,0001,078,0002,113,536
6Sep 24, 2026 07:523,44238,072,55227,497,0001,075,0002,113,536
7Sep 24, 2026 07:524,93549,684,31527,888,00013,075,0002,113,536
8Sep 24, 2026 07:524,94449,817,63127,699,00013,337,0002,113,536
9Sep 24, 2026 07:525,03452,657,24728,426,00013,358,0002,113,536