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 4, 2026 00:38Josu San MartinJosu San MartinScore: 9,779Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 00:389,58488,894,57876,313,0003,238,0002,113,536
2Jul 4, 2026 00:389,67289,748,33376,996,0003,288,0002,113,536
3Jul 4, 2026 00:389,67689,714,65477,060,0003,253,0002,113,536
4Jul 4, 2026 00:389,68489,663,88477,093,0003,291,0002,113,536
5Jul 4, 2026 00:389,77990,513,93777,917,0003,249,0002,113,536
6Jul 4, 2026 00:389,78190,582,97677,866,0003,320,0002,113,536
7Jul 4, 2026 00:389,85291,066,75678,533,0003,242,0002,113,536
8Jul 4, 2026 00:389,88691,452,91079,022,0003,038,0002,113,536
9Jul 4, 2026 00:3810,72398,371,90685,699,0003,307,0002,113,536