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 listJul 5, 2026 20:20Victor MerckléVictor MerckléScore: 5,967Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 20:205,95757,370,29048,408,0001,038,0002,117,632stderr
2Jul 5, 2026 20:205,95857,356,68748,409,0001,047,0002,117,632stderr
3Jul 5, 2026 20:205,96057,324,36848,410,0001,059,0002,117,632stderr
4Jul 5, 2026 20:205,96357,435,80648,389,0001,110,0002,117,632stderr
5Jul 5, 2026 20:205,96757,970,82648,421,0001,112,0002,117,632stderr
6Jul 5, 2026 20:205,96858,124,72748,405,0001,137,0002,117,632stderr
7Jul 5, 2026 20:205,97558,145,36548,466,0001,132,0002,117,632stderr
8Jul 5, 2026 20:205,97657,478,90148,490,0001,118,0002,117,632stderr
9Jul 5, 2026 20:205,98058,167,87248,502,0001,136,0002,117,632stderr