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 25, 2026 00:24Victor MerckléVictor MerckléScore: 6,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 00:266,08158,846,86430,496,00019,981,0002,117,632stderr
2Aug 25, 2026 00:266,09058,952,15330,528,00020,019,0002,117,632stderr
3Aug 25, 2026 00:266,11059,123,11730,851,00019,865,0002,117,632stderr
4Aug 25, 2026 00:266,11559,144,69730,671,00020,091,0002,117,632stderr
5Aug 25, 2026 00:266,11659,188,63530,917,00019,848,0002,117,632stderr
6Aug 25, 2026 00:266,12359,289,68930,979,00019,847,0002,117,632stderr
7Aug 25, 2026 00:266,15959,542,43331,206,00019,915,0002,117,632stderr
8Aug 25, 2026 00:266,23860,175,59531,924,00019,859,0002,117,632stderr
9Aug 25, 2026 00:266,30461,454,98332,436,00019,891,0002,117,632stderr