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 23, 2026 16:09satoru.netsatoru.netScore: 40,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 16:0940,077361,086,645332,638,00002,359,296
2Feb 23, 2026 16:0940,135360,160,456333,120,00002,342,912
3Feb 23, 2026 16:0940,167363,168,533332,390,000998,0002,347,008