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 2, 2026 08:35TonyTonyScore: 28,541Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 08:3528,511245,130,982235,534,0001,112,0002,117,632
2Aug 2, 2026 08:3528,526244,998,709235,661,0001,105,0002,117,632
3Aug 2, 2026 08:3528,529245,019,054235,675,0001,116,0002,117,632
4Aug 2, 2026 08:3528,532245,381,928235,673,0001,148,0002,117,632
5Aug 2, 2026 08:3528,541245,266,227235,767,0001,124,0002,117,632
6Aug 2, 2026 08:3528,546245,224,058235,739,0001,193,0002,117,632
7Aug 2, 2026 08:3528,632246,022,681236,379,0001,269,0002,117,632
8Aug 2, 2026 08:3528,724246,893,000237,307,0001,107,0002,117,632
9Aug 2, 2026 08:3528,775247,091,645237,725,0001,114,0002,117,632