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 listFeb 15, 2026 23:04wnwnScore: 9,191Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 23:048,01689,994,83959,473,0007,056,0002,277,376
2Feb 15, 2026 23:078,02693,060,89060,563,0006,056,0002,473,984
3Feb 15, 2026 23:078,05588,347,74257,876,0008,980,0002,473,984
4Feb 15, 2026 23:048,12889,648,04860,415,0007,048,0002,461,696
5Feb 15, 2026 23:078,16796,268,60161,808,0005,981,0002,469,888
6Feb 15, 2026 23:048,23690,171,60260,320,0008,042,0002,506,752
7Feb 15, 2026 23:049,19198,692,98368,259,0008,030,0002,449,408
8Feb 15, 2026 23:049,248103,626,49068,781,0007,974,0002,469,888
9Feb 15, 2026 23:079,288105,151,58366,075,00011,012,0002,469,888
10Feb 15, 2026 23:079,294106,305,54067,120,00010,018,0002,318,336
11Feb 15, 2026 23:049,370107,326,47970,790,0006,979,0002,318,336
12Feb 15, 2026 23:079,417105,480,26867,139,00011,022,0002,293,760