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 listDec 6, 2025 10:53Rajarshi BasuRajarshi BasuScore: 7,457Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 10:537,44488,506,11458,798,0002,989,0002,281,472
2Dec 6, 2025 10:537,45087,253,86659,837,0001,994,0002,281,472
3Dec 6, 2025 10:537,45487,261,21359,875,0001,995,0002,379,776
4Dec 6, 2025 10:537,45787,254,58259,901,0001,996,0002,379,776
5Dec 6, 2025 10:537,46595,024,20658,963,0002,998,0002,289,664
6Dec 6, 2025 10:537,52585,755,85060,447,0002,014,0002,289,664