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 26, 2026 03:52zielajzielajScore: 3,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 03:533,39144,202,99727,147,0001,005,0002,420,736
2Apr 26, 2026 03:533,39349,974,21027,164,0001,006,0002,428,928
3Apr 26, 2026 03:533,39943,903,16927,212,0001,007,0002,428,928
4Apr 26, 2026 03:533,45946,649,62827,688,0001,025,0002,420,736
5Apr 26, 2026 03:533,46847,458,13426,800,0001,985,0002,420,736
6Apr 26, 2026 03:533,47644,942,15626,867,0001,990,0002,424,832
7Apr 26, 2026 03:533,49144,181,07625,984,0002,998,0002,433,024
8Apr 26, 2026 03:533,59647,895,32827,860,0001,990,0002,306,048
9Apr 26, 2026 03:533,60052,008,78227,895,0001,992,0002,433,024