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 listApr 8, 2026 16:45limanjun99limanjun99Score: 10,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 8, 2026 16:4510,621113,252,05777,138,00011,019,0002,359,296
2Apr 8, 2026 16:4510,689116,930,13080,744,0007,974,0002,359,296
3Apr 8, 2026 16:4510,796115,189,99378,535,00011,075,0002,441,216