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 listJul 27, 2025 04:12Serendipity1902Serendipity1902Score: 83,134Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2025 04:1282,691707,988,930584,432,000101,901,0002,437,120
2Jul 27, 2025 04:1283,134720,626,787584,014,000106,002,0002,269,184
3Jul 27, 2025 04:1283,171720,081,022585,423,000104,896,0002,433,024