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:00Serendipity1902Serendipity1902Score: 67,394Success
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:0067,217580,715,403492,916,00064,988,0002,445,312
2Jul 27, 2025 04:0067,243583,180,279493,105,00065,013,0002,531,328
3Jul 27, 2025 04:0067,274581,886,658491,450,00066,925,0002,437,120
4Jul 27, 2025 04:0067,390585,013,522493,413,00065,921,0002,449,408
5Jul 27, 2025 04:0067,394581,194,774493,443,00065,925,0002,437,120
6Jul 27, 2025 04:0067,419583,534,791492,625,00066,949,0002,531,328
7Jul 27, 2025 04:0067,429588,078,647492,704,00066,959,0002,437,120
8Jul 27, 2025 04:0067,564583,723,702493,810,00066,974,0002,486,272
9Jul 27, 2025 04:0068,649592,681,828497,814,00071,973,0002,478,080