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 21, 2026 01:20zielajzielajScore: 3,751Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 01:213,49247,773,27526,983,0001,998,0002,433,024
2Mar 21, 2026 01:213,59554,272,45828,843,000994,0002,441,216
3Mar 21, 2026 01:213,60149,578,71028,860,0001,030,0002,445,312
4Mar 21, 2026 01:203,75150,140,58829,128,0002,008,0002,519,040
5Mar 21, 2026 01:203,81155,125,95130,613,0001,020,0002,445,312
6Mar 21, 2026 01:203,86565,304,71030,074,0002,004,0002,260,992