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 listMar 19, 2026 00:58Ondřej PolaneckýOndřej PolaneckýScore: 10,145Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 00:5810,130110,424,21782,078,0002,001,0002,289,664
2Mar 19, 2026 00:5810,132109,620,19982,094,0002,002,0002,289,664
3Mar 19, 2026 00:5810,134112,290,67182,111,0002,002,0002,289,664
4Mar 19, 2026 00:5810,141113,700,64182,165,0002,004,0002,289,664
5Mar 19, 2026 00:5810,145112,024,44283,200,0001,002,0002,519,040
6Mar 19, 2026 00:5810,155106,627,84182,280,0002,006,0002,379,776
7Mar 19, 2026 00:5810,156112,764,53582,290,0002,007,0002,289,664
8Mar 19, 2026 00:5810,157108,029,25482,292,0002,007,0002,289,664
9Mar 19, 2026 00:5810,158106,798,46382,304,0002,007,0002,269,184