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 listSep 24, 2026 03:16wnwnScore: 3,988Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 03:173,35736,706,06626,828,0001,037,0002,113,536
2Sep 24, 2026 03:173,36136,709,58526,889,0001,009,0002,113,536
3Sep 24, 2026 03:173,50638,475,05328,076,0001,032,0002,113,536
4Sep 24, 2026 03:173,90241,149,01927,259,0005,134,0002,113,536
5Sep 24, 2026 03:173,98842,573,22028,324,0004,784,00020,480
6Sep 24, 2026 03:174,05643,110,86128,607,0005,065,0002,113,536
7Sep 24, 2026 03:174,22543,832,03227,201,0007,873,0002,113,536
8Sep 24, 2026 03:174,24343,882,59027,389,0007,834,0002,113,536
9Sep 24, 2026 03:174,25544,026,99127,445,0007,878,0002,113,536