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 listMar 20, 2026 03:12zielajzielajScore: 3,475Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 03:123,43152,645,45927,461,0001,017,0002,441,216
2Mar 20, 2026 03:113,43751,093,16327,506,0001,018,0002,437,120
3Mar 20, 2026 03:123,44959,991,76327,602,0001,022,0002,519,040
4Mar 20, 2026 03:123,45252,617,18627,625,0001,023,0002,486,272
5Mar 20, 2026 03:113,45552,547,44527,649,0001,024,0002,482,176
6Mar 20, 2026 03:113,47551,560,26226,855,0001,989,0002,441,216
7Mar 20, 2026 03:123,47555,275,11026,856,0001,989,0002,523,136
8Mar 20, 2026 03:123,47559,045,57527,849,000994,0002,441,216
9Mar 20, 2026 03:123,48448,555,41026,926,0001,994,0002,482,176
10Mar 20, 2026 03:123,52754,417,97528,264,0001,009,0002,260,992
11Mar 20, 2026 03:123,59154,570,76027,818,0001,987,0002,445,312
12Mar 20, 2026 03:123,63156,884,75528,128,0002,009,0002,519,040