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 listJan 1, 2026 19:49Josu San MartinJosu San MartinScore: 6,549Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 19:496,18778,935,89050,344,0001,006,0002,351,104
2Jan 1, 2026 19:496,24676,785,14949,845,0001,993,0002,273,280
3Jan 1, 2026 19:496,28581,621,35350,163,0002,006,0002,445,312
4Jan 1, 2026 19:496,52981,733,93152,182,0002,007,0002,457,600
5Jan 1, 2026 19:496,53380,075,46952,219,0002,008,0002,326,528
6Jan 1, 2026 19:496,54080,316,14651,267,0003,015,0002,293,760
7Jan 1, 2026 19:496,54979,801,46451,334,0003,019,0002,355,200
8Jan 1, 2026 19:496,55081,972,64351,345,0003,020,0002,289,664
9Jan 1, 2026 19:496,56780,602,55852,492,0002,018,0002,371,584
10Jan 1, 2026 19:496,56777,648,06153,501,0001,009,0002,424,832
11Jan 1, 2026 19:496,60085,053,62150,799,0003,984,0002,453,504
12Jan 1, 2026 19:496,64792,176,92353,166,0002,006,0002,265,088