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 21, 2025 19:33sheryllynn24sheryllynn24Score: 8,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2025 19:338,866100,203,06970,564,0003,024,0002,510,848
2Sep 21, 2025 19:338,869104,595,05872,605,0001,008,0002,449,408
3Sep 21, 2025 19:338,90798,141,91270,935,0002,997,0002,273,280
4Sep 21, 2025 19:338,95697,623,97671,319,0003,013,0002,437,120
5Sep 21, 2025 19:338,973105,355,07272,464,0002,012,0002,273,280
6Sep 21, 2025 19:339,073103,685,98872,292,0003,012,0002,514,944