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 listApr 24, 2026 08:02Dominique GarmierDominique GarmierScore: 7,376Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 08:037,20681,608,29956,827,0002,990,0002,437,120
2Apr 24, 2026 08:037,22277,251,44756,949,0002,997,0002,428,928
3Apr 24, 2026 08:037,25673,824,61157,214,0003,011,0002,437,120
4Apr 24, 2026 08:037,27777,585,48358,392,0002,013,0002,338,816
5Apr 24, 2026 08:037,37682,801,87458,218,0003,011,0002,433,024
6Apr 24, 2026 08:037,40079,372,21059,409,0002,013,0002,437,120
7Apr 24, 2026 08:037,41082,463,34159,490,0002,016,0002,437,120
8Apr 24, 2026 08:037,41275,825,64659,508,0002,017,0002,445,312
9Apr 24, 2026 08:037,41577,779,37359,531,0002,018,0002,441,216