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:57Serendipity1902Serendipity1902Score: 52,605Success
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:5752,603467,870,175434,603,0001,998,0002,400,256
2Jul 27, 2025 04:5752,605459,520,040435,623,000999,0002,269,184
3Jul 27, 2025 04:5752,607464,947,641434,642,0001,998,0002,269,184