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 listMay 7, 2026 10:28wnwnScore: 3,428Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:293,39143,627,40027,082,0001,066,0002,486,272
2May 7, 2026 10:293,39343,400,13427,109,0001,054,0002,482,176
3May 7, 2026 10:293,39942,689,70527,156,0001,061,0002,490,368
4May 7, 2026 10:293,40145,406,48827,166,0001,065,0002,490,368
5May 7, 2026 10:293,42844,043,97427,343,0001,112,0002,482,176
6May 7, 2026 10:293,44144,745,02127,492,0001,075,0002,482,176
7May 7, 2026 10:293,45946,228,14027,596,0001,115,0002,482,176
8May 7, 2026 10:293,52544,302,85928,188,0001,074,0002,482,176
9May 7, 2026 10:293,55144,354,97328,380,0001,097,0002,482,176