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 3, 2026 22:25aLaLScore: 2,069,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2026 22:252,065,44617,172,717,86117,068,233,00074,970,0002,281,472
2Apr 3, 2026 22:252,066,03717,180,227,71917,075,137,00072,966,0002,281,472
3Apr 3, 2026 22:252,067,39217,194,652,11617,087,387,00071,963,0002,519,040
4Apr 3, 2026 22:252,068,11017,204,018,97117,103,346,00061,968,0002,281,472
5Apr 3, 2026 22:252,069,16817,207,062,26217,093,136,00080,958,0002,281,472
6Apr 3, 2026 22:252,069,31217,205,769,57517,119,320,00055,971,0002,281,472
7Apr 3, 2026 22:252,069,62017,210,143,49917,118,874,00058,972,0002,281,472
8Apr 3, 2026 22:252,069,72117,214,302,30117,110,719,00067,967,0002,293,760
9Apr 3, 2026 22:252,070,63817,219,345,91217,128,322,00057,974,0002,281,472