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 listApr 22, 2026 01:37Taylor DettlingTaylor DettlingScore: 8,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 01:378,81691,631,10767,166,0006,014,0002,482,176
2Apr 22, 2026 01:378,83388,039,06868,299,0005,022,0002,453,504
3Apr 22, 2026 01:378,83592,973,00969,316,0004,018,0002,490,368
4Apr 22, 2026 01:378,85189,824,04969,445,0004,025,0002,396,160
5Apr 22, 2026 01:378,87891,757,81665,722,0007,966,0002,523,136
6Apr 22, 2026 01:378,92693,814,55569,083,0005,006,0002,465,792
7Apr 22, 2026 01:378,94392,492,63967,210,0007,021,0002,465,792
8Apr 22, 2026 01:378,98794,704,04571,570,0003,024,0002,473,984
9Apr 22, 2026 01:378,99692,303,24468,617,0006,054,0002,412,544