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 12, 2026 07:44Victor MerckléVictor MerckléScore: 77,450Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 07:4577,347650,369,895636,658,0005,330,0002,117,632stderr
2Aug 12, 2026 07:4577,361650,483,924636,818,0005,281,0002,117,632stderr
3Aug 12, 2026 07:4577,406650,977,123636,833,0005,639,0002,117,632stderr
4Aug 12, 2026 07:4577,421651,003,801637,239,0005,361,0002,117,632stderr
5Aug 12, 2026 07:4577,450651,235,775637,408,0005,430,0002,117,632stderr
6Aug 12, 2026 07:4577,997655,797,085642,023,0005,356,0002,117,632stderr
7Aug 12, 2026 07:4578,082656,299,464642,688,0005,394,0002,117,632stderr
8Aug 12, 2026 07:4578,173657,595,163642,857,0005,986,0002,117,632stderr
9Aug 12, 2026 07:4578,195657,451,437643,697,0005,329,0002,117,632stderr