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 listAug 28, 2026 20:58Victor MerckléVictor MerckléScore: 5,425Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 20:595,39353,797,09243,734,0001,036,0002,117,632stderr
2Aug 28, 2026 20:595,40353,869,75243,816,0001,037,0002,117,632stderr
3Aug 28, 2026 20:595,40453,905,20443,827,0001,030,0002,117,632stderr
4Aug 28, 2026 20:595,42354,066,23243,978,0001,040,0002,117,632stderr
5Aug 28, 2026 20:595,42554,077,57543,987,0001,042,0002,117,632stderr
6Aug 28, 2026 20:595,42754,084,64444,033,0001,018,0002,117,632stderr
7Aug 28, 2026 20:595,44854,284,78244,205,0001,018,0002,117,632stderr
8Aug 28, 2026 20:595,45454,319,54244,252,0001,018,0002,117,632stderr
9Aug 28, 2026 20:595,48654,620,85544,510,0001,031,0002,117,632stderr