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 listJul 3, 2026 19:37Josu San MartinJosu San MartinScore: 10,050Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 19:379,93391,869,14275,386,0007,064,0002,121,728
2Jul 3, 2026 19:3710,02092,573,72976,157,0007,014,0002,117,632
3Jul 3, 2026 19:3710,02292,548,16276,244,0006,939,0002,121,728
4Jul 3, 2026 19:3710,04193,176,23876,319,0007,026,0002,121,728
5Jul 3, 2026 19:3710,05094,113,88076,294,0007,124,0002,121,728
6Jul 3, 2026 19:3710,09293,095,61276,375,0007,389,0002,121,728
7Jul 3, 2026 19:3710,10293,179,32776,656,0007,193,0002,121,728
8Jul 3, 2026 19:3710,20194,249,82977,696,0006,975,0002,117,632
9Jul 3, 2026 19:3710,23694,410,22178,034,0006,928,0002,117,632