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 03:35wnwnScore: 3,437Success
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 03:363,39036,956,07327,124,0001,020,00020,480
2Sep 24, 2026 03:363,41137,155,00527,263,0001,053,00020,480
3Sep 24, 2026 03:363,42337,168,49327,374,0001,040,0002,113,536
4Sep 24, 2026 03:363,43037,289,76327,273,0001,201,00020,480
5Sep 24, 2026 03:363,43737,339,49527,359,0001,169,00020,480
6Sep 24, 2026 03:363,44037,366,75727,433,0001,125,0002,113,536
7Sep 24, 2026 03:363,46537,490,16927,694,0001,072,0002,113,536
8Sep 24, 2026 03:363,62039,493,54329,004,0001,049,00020,480
9Sep 24, 2026 03:363,66139,092,17429,157,0001,232,0002,113,536