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 26, 2026 18:50Victor MerckléVictor MerckléScore: 3,796Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 18:513,77539,671,62530,193,0001,144,0002,113,536
2Aug 26, 2026 18:513,78039,665,01930,233,0001,148,0002,113,536
3Aug 26, 2026 18:513,78039,644,76930,226,0001,148,0002,113,536
4Aug 26, 2026 18:513,78739,742,01530,374,0001,063,0002,113,536
5Aug 26, 2026 18:513,79639,805,82730,362,0001,148,0002,113,536
6Aug 26, 2026 18:513,79739,690,74130,380,0001,136,0002,113,536
7Aug 26, 2026 18:513,82840,847,32230,642,0001,131,0002,113,536
8Aug 26, 2026 18:513,83040,826,94330,672,0001,120,0002,113,536
9Aug 26, 2026 18:513,91148,755,29731,330,0001,137,0002,113,536