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 listOct 21, 2026 00:02Nao MinamiNao MinamiScore: 38,910Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 00:0238,868333,386,408263,159,00059,448,0002,117,632
2Oct 21, 2026 00:0238,889333,603,721262,778,00060,006,0002,117,632
3Oct 21, 2026 00:0238,889333,621,433263,092,00059,693,0002,117,632
4Oct 21, 2026 00:0238,893333,629,295263,120,00059,696,0002,121,728
5Oct 21, 2026 00:0238,910333,796,047263,160,00059,799,0002,117,632
6Oct 21, 2026 00:0238,923333,881,633263,169,00059,892,0002,117,632
7Oct 21, 2026 00:0238,939334,021,357263,114,00060,085,0002,117,632
8Oct 21, 2026 00:0238,975334,249,423263,298,00060,195,0002,117,632
9Oct 21, 2026 00:0238,988334,450,128263,096,00060,511,0002,117,632