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 listJan 2, 2026 06:16Josu San MartinJosu San MartinScore: 6,361Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 06:166,06973,148,38149,365,0001,007,0002,502,656
2Jan 2, 2026 06:166,07279,002,27747,376,0003,024,0002,322,432
3Jan 2, 2026 06:166,14877,673,24950,026,0001,000,0002,519,040
4Jan 2, 2026 06:166,36177,539,33449,808,0002,988,0002,347,008
5Jan 2, 2026 06:166,36182,604,86950,802,0001,992,0002,490,368
6Jan 2, 2026 06:166,38580,551,38047,995,0004,999,0002,404,352