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 4, 2026 04:35Josu San MartinJosu San MartinScore: 6,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 4, 2026 04:355,88470,684,07547,821,0001,017,0002,273,280
2Jan 4, 2026 04:345,88970,770,63846,882,0001,994,0002,445,312
3Jan 4, 2026 04:345,88974,482,75746,882,0001,994,0002,281,472
4Jan 4, 2026 04:355,91074,849,79347,050,0002,002,0002,281,472
5Jan 4, 2026 04:345,93574,253,60547,253,0002,010,0002,273,280
6Jan 4, 2026 04:355,95770,529,46148,431,0001,008,0002,453,504
7Jan 4, 2026 04:346,00075,601,97449,803,00002,445,312
8Jan 4, 2026 04:356,00276,614,77947,822,0001,992,0002,285,568
9Jan 4, 2026 04:356,00875,791,63247,875,0001,994,0002,285,568
10Jan 4, 2026 04:346,02268,982,67247,987,0001,999,0002,281,472
11Jan 4, 2026 04:346,05075,300,36348,206,0002,008,0002,441,216
12Jan 4, 2026 04:356,05870,838,06749,279,0001,005,0002,437,120