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 listFeb 18, 2026 22:21wnwnScore: 5,642Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 22:215,54571,470,67845,027,0001,000,0002,449,408
2Feb 18, 2026 22:215,58865,212,75046,380,00002,273,280
3Feb 18, 2026 22:215,61776,780,56845,608,0001,013,0002,269,184
4Feb 18, 2026 22:215,64275,734,29943,842,0002,989,0002,273,280
5Feb 18, 2026 22:215,77870,574,13744,959,0002,997,0002,445,312
6Feb 18, 2026 22:215,79571,775,38646,094,0002,004,0002,449,408